An ant colony system for solving fuzzy flow shop scheduling problem
نویسندگان
چکیده
منابع مشابه
An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem
An integrated ant colony optimization algorithm (IACS-HFS) is proposed for a multistage hybrid flow-shop scheduling problem. The objective of scheduling is the minimization of the makespan. To solve this NP-hard problem, the IACS-HFS considers the assignment and sequencing sub-problems simultaneously in the construction procedures. The performance of the algorithm is evaluated by numerical expe...
متن کاملAn ant colony optimization algorithm for job shop scheduling problem
The nature has inspired several metaheuristics, outstanding among these is Ant Colony Optimization (ACO), which have proved to be very effective and efficient in problems of high complexity (NP-hard) in combinatorial optimization. This paper describes the implementation of an ACO model algorithm known as Elitist Ant System (EAS), applied to a combinatorial optimization problem called Job Shop S...
متن کاملAn ant colony system for permutation flow-shop sequencing
Ant colony system (ACS) is a novel meta-heuristic inspired by the foraging behavior of real ant. This paper is the 2rst to apply ACS for the n=m=P=Cmax problem, an NP-hard sequencing problem which is used to 2nd a processing order of n di6erent jobs to be processed on m machines in the same sequence with minimizing the makespan. To verify the developed ACS algorithm, computational experiments a...
متن کاملAn Efficient Ant Colony Optimization Algorithm for Multiobjective Flow Shop Scheduling Problem
In this paper an ant colony optimization algorithm is developed to solve the permutation flow shop scheduling problem. In the permutation flow shop scheduling problem which has been vastly studied in the literature, there are a set of machines and a set of jobs. All the jobs are processed on all the machines and the sequence of jobs being processed is the same on all the machines. Here this pro...
متن کاملSolving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2012
ISSN: 2227-524X
DOI: 10.14419/ijet.v1i2.23